- extendible array
- выдвижная АР
English-Russian dictionary of telecommunications and their abbreviations. A.V. Alexandrov.. 2004.
extendible array
Смотреть что такое "extendible array" в других словарях:
Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Trie — A trie for keys A , to , tea , ted , ten , i , in , and inn . In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search… … Wikipedia
Minibond — is a brand name for a series of structured financial notes issued in Hong Kong under the control of Lehman Brothers. It is a misnomer to describe the Minibond as credit linked note because of the Synthetic Collateralised Debt Obligations hidden… … Wikipedia
Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… … Wikipedia
KITT — is the acronymic descriptor for the fictional adventure series Knight Rider character. KITT is an artificial intelligence microprocessor installed in a highly advanced, very mobile, robot disguised as a 1982 Pontiac Firebird Trans Am.The original … Wikipedia
Cairo International Airport — Infobox Airport name = Cairo International Airport nativename a = مطار القاهرة الدولي IATA = CAI ICAO = HECA type = Public owner = operator = Cairo Airport Authority city served = Cairo, Egypt location = elevation f = 382 elevation m = 116… … Wikipedia
SpadFS — Infobox filesystem name = SpadFS developer = Mikuláš Patočka full name = introduction date = introduction os = partition id = directory struct = file struct = bad blocks struct = max file size = max files no = max filename size = max volume size … Wikipedia
